A Branch and Bound Reduction Algorithm for Solving a Class of Sums of Linear Multiplicative Programming Problems
نویسندگان
چکیده
منابع مشابه
A Branch and Bound Approach for Solving a Class of Generalized Semi-Infinite Programming Problems
A nonconvex generalized semi-infinite programming problem is considered involving parametric max-functions in both, the objective and the constraints. For a fixed vector of parameters, the values of these parametric max-functions are given as optimal values of convex quadratic programming problems. Assuming that for each parameter the parametric quadratic problems satisfy the strong duality rel...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملA Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming
A simplicial branch and bound duality-bounds algorithm is presented to globally solving the linear multiplicative programming (LMP).We firstly convert the problem (LMP) into an equivalent programming one by introducing p auxiliary variables. During the branch and bound search, the required lower bounds are computed by solving ordinary linear programming problems derived by using a Lagrangian du...
متن کاملA Parallel Branch and Bound Algorithm for Solving Large Scale Integer Programming Problems
Branch and Bound technique is commonly used for intelligent search in finding a set of integer solutions within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. While the master-worker paradigm is successfully used in many parallel applications as a common framework to i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research and Fuzziology
سال: 2017
ISSN: 2163-1476,2163-1530
DOI: 10.12677/orf.2017.74012